The Distributed Queuing (DQ) algorithm is predicted as one of the solutions\nto the issues currently found in IoT networks over the use of Aloha based algorithms.\nSince recently, the algorithm has been of interest to many IoT researchers\nas a replacement of those Aloha variants for channel access. However,\nprevious works analyzed and evaluated the DQ algorithm without any\nconsideration of the stability of its queues, assuming it is stable for any given\nnumber of nodes in the network. In this paper, we define the DQ stability\ncondition in a single-channel M2M environment considering a traffic model\nof periodic and urgent frames from each node in the network. Besides, a steadystate\nevaluation of the algorithmâ??s performance metrics is also presented. In\ngeneral, the DQ algorithm, when it is stable, was observed not to efficiently\nuse the contention slots for the collision resolution. In a single-channel environment,\nthe DQ algorithm is found to outperform the Aloha based algorithms\nonly in an idle-to-saturation scenario.
Loading....